Ooset-polygon Annulus Placement Problems ?
نویسندگان
چکیده
In this paper we address several variants of the polygon an-nulus placement problem: given an input polygon P and a set S of points, nd an optimal placement of P that maximizes the number of points in S that fall in a certain annulus region deened by P and some ooset distance > 0. We address the following variants of the problem: placement of a convex polygon as well as a simple polygon; placement by translation only, or by a translation and a rotation; oo-line and on-line versions of the corresponding decision problems; and decision as well as optimization versions of the problems. We present eecient algorithms in each case.
منابع مشابه
Optimal Polygon Placement
Given a simple polygon P with m vertices and a set S of n points in the plane, we consider the problem of finding a rigid motion placement of P that contains the maximum number of points in S. We present two solutions to this problem that represent time versus space tradeoffs. The first algorithm runs in O(n3m3) expected time using O(n2m2) space. The second algorithm runs in O(n3m3 log(nm)) det...
متن کاملSingle - Layer Channel Routing and Placement with Single - SidedNetsRonald
This paper considers the optimal ooset, feasible ooset, and optimal placement problems for a more general form of single-layer VLSI channel routing than has usually been considered in the past. Most prior works require that every net has exactly one terminal on each side of the channel. As long as only one side of the channel contains multiple terminals of the same net, we provide linear-time s...
متن کاملOptimizing a constrained convex polygonal annulus
In this paper we give solutions to several constrained polygon annulus placement problems for offset and scaled polygons, providing new efficient primitive operations for computational metrology and dimensional tolerancing. Given a convex polygon P and a planar point set S, the goal is to find the thinnest annulus region of P containing S. Depending on the application, there are several ways th...
متن کاملVoronoi Diagrams for Polygon-Offset Distance Functions
In this paper we develop the concept of a polygon-ooset distance function and show how to compute the respective nearest-and furthest-site Voronoi diagrams of point sites in the plane. We provide optimal deterministic O(n(log n + log m) + m)-time algorithms, where n is the number of points and m is the complexity of the underlying polygon, for computing compact representations of both diagrams.
متن کامل